Quaternions, introduced by Hamilton in 1843 as a generalization of complexnumbers, have found, in more recent years, a wealth of applications in a numberof different areas which motivated the design of efficient methods fornumerically approximating the zeros of quaternionic polynomials. In fact, onecan find in the literature recent contributions to this subject based on theuse of complex techniques, but numerical methods relying on quaternionarithmetic remain scarce. In this paper we propose a Weierstrass-like methodfor finding simultaneously {\sl all} the zeros of unilateral quaternionicpolynomials. The convergence analysis and several numerical examplesillustrating the performance of the method are also presented.
展开▼
